System and method for protecting a TCP connection serving system from high-volume of TCP connection requests

ABSTRACT

To prevent system crashs, as by denial-of-service attacks, of TCP/IP (Transmission Control Protocol/Internet Protocol) networks, this invention regulates the volume of TCP connection requests that await service at a TCP/IP connection control table. For this purpose, the usage of the system is monitored on a dynamic basis, the time-out value T ho  is dynamically computed, and requests that that have been awaiting service for a period of time that exceeds T ho  are removed from the TCP/IP connection control table.

FIELD OF THE INVENTION

[0001] The present invention relates generally to the TCP/IP (Transmission Control Protocol/Internet Protocol) based networks and systems and more particularly to those systems and components that keeps TCP connection related status information, such as the TCP connection control table, for the management of connections. Those management may include serving, filtering, load balancing, routing, redirecting, etc. of TCP connections.

DESCRIPTION OF THE PRIOR ART

[0002] The TCP/IP is a foundation for the world's largest network, Internet, as well as for the intranet and extranet, and it has become the core for data/voice/video communications and streaming. It has also become the major default communications protocols for connecting variety of digital entities.

[0003] When a networked digital entity that keeps track of TCP connection states receives a very high-volume of legitimate and/or illegitimate TCP connection requests, it runs the risk of flooding its TCP connection-related tables, which often leads to system quiescence or system crash. Such digital entities include today's servers, storage area networks, network attached storage and clusters of such entities. Future entities may include memory subsystems, storage subsystems and more general I/O subsystems that can be independently deployed throughout the network to form the distributed components of a digital entity that are connected together via high-bandwidth networks.

[0004] It is known that the purpose of a SYN (synchronization) flood (i.e., sending of large volume of “false” TCP connection requests) is to create a large number of long-lasting half-open TCP connections to fill the TCP connection control table in order for no other new connection requests to be accepted. This is known as a denial of service attack. A half-open connection is a connection whose 3-way hand shake hasn't been completed yet.

[0005] Every TCP connection establishment will experience some time duration for the half-open state before the associated TCP connection has been established. The duration of the half-open state depends on a number of parameters. Some of them include the conditions of two parties, how far two parties are located, what networks are being used to connect these two parties, congestion of these networks, the speed at which these two parties are connected to networks, and whether or not the intent of connection establishment is “sincere”. In general, the half-open duration of a TCP connection establishment is short and is usually less than a second or so. A TCP connection request (from now on, simply a request or requests) associated with the SYN flood, for example, will eventually time-out. A typical time-out value is anywhere between 60 seconds and 120 seconds. In this patent application, the term “legitimate” or “good” is used to reference a “sincere” TCP connection request, and the term “illegitimate” or “bad” is used to reference a “not-sincere” TCP connection request.

[0006] A simple way to avoid filling up the TCP connection control table is to start discarding (or redirecting) future requests once a certain threshold of table utilization has been reached. This approach works well when no differentiation among TCP connection requests is needed. Some of major problems of this approach are (1) there is no way to differentiate legitimate requests from illegitimate requests (a preferable approach is to discard illegitimate requests first and then legitimates requests next if needed) and (2) the implementation of this approach requires some modification of existing systems, thus making its deployment more difficult.

[0007] The way to determine whether or not a TCP connection request is legitimate is to accept the connection request (assuming the requester has a valid IP address and port number) and observe whether or not its TCP half-open connection state moves to the “connected” state or it simply faces the half-open time-out. Not every “timed-out” half-open request is illegitimate or “not sincere”. However, it is a good practice to discard or reset those TCP connection requests that stay in the half-open state unreasonably long.

[0008] In the TCP/IP protocols, there is a time-out parameter for controlling the duration of the half-open state called “half-open time-out”. T_(ho) shall hereinafter denote this “half-open time-out”. Clearly, by changing the value of T_(ho), one can control the maximum duration for each TCP connection request to stay in the half-open state. Once a connection request faces its time-out, the corresponding entry will be removed from the control table. The removed TCP connection request could be either simply discarded or reset. Therefore, the management of T_(ho) leads to the management of the use (or usage) of the TCP connection control table. The Lucent Access Point (AP) product (www.lucent.com/products) allows a user to choose one of two operation modes corresponding to the half-open time-out. One mode corresponding to a normal operation and another corresponding to a critical mode called “SYN Defender”. This “SYN Defender” mode can be invoked to protect systems from SYN Flood type denial of service attacks. The SYN Defender mode uses a very small value for T_(ho), thus limiting the life cycle of the half-open connection state for TCP connection request. The major limitations of this approach are that its operation mode is invoked manually, it supports only two states (normal and SYN Defender) and it is not adaptable to changes in operation environment.

BRIEF SUMMARY OF THE INVENTION

[0009] The object of this invention is to provide a system and method that protect a TCP connection serving system from high-volume of TCP connection requests (both good and bad) which often lead to system quiescence or crash by dynamically adjusting the half-open connection time-out T_(ho), that is used to “clean up” the TCP connection control table. A T_(ho) is defined for each TCP connection control table and it is dynamically adjusted. This invention has a means to observe the use (or usage) of the TCP connection control table(s), a means to compute the next T_(ho), value and a means to inform the value to any existing TCP/IP “stack”. The T_(ho), value ranges between the minimum T_(min) and the maximum T_(max).

[0010] Another object of this invention is to make the system and method adaptable to different operating environment by dynamically adjusting the range [T_(min), T_(max)] in which T_(ho) can operate. This invention has a means to derive both T_(min) and T_(max). Examples of operating environment of this invention include Internet, intranet, extranet, back-end network infrastructure, and storage area network.

[0011] Yet another object of this invention is to provide an optional means that can be used to further protect a system with the TCP connection control table by preventing from fully utilizing the TCP connection control table by providing a means to throttle newly arriving TCP connection requests in the event that the table utilization had reached a predetermined level.

[0012] Accordingly, the present invention broadly provides a method of regulating TCP/IP connection requests which await service in a system by a TCP/IP connection control table to prevent overload thereof, the aforesaid method comprising the steps of:

[0013] a) monitoring usage of the aforesaid system on a dynamic basis,

[0014] b) based upon the aforesaid usage, dynamically computing a time-out value T_(ho) which defines the time duration that a TCP connection request may await service by the system,

[0015] c) removing from the aforesaid TCP/IP connection control table all TCP/IP connection requests which have been awaiting service in said TCP/IP stack for a duration exceeding T_(ho)

[0016] Preferably, the aforesaid TCP/IP connection control table has a size N_(size) and an upper bound for usable table size of N_(abs)≦N_(size), and where values of T_(ho) are dynamically computed in a range [T_(min), T_(max)]

[0017] According to a preferred embodiment, the method according t a preferred embodiment of the invention comprises the steps of:

[0018] i) setting T_(ho)=T_(min) when N>N_(abs)

[0019] ii) when N>N_(limit) setting T_(ho)=max{T_(min), T′_(ho)/A}, where T′_(ho) is a previously existing value of T_(ho), where A>1, where N is the current usage of the table, and where 0≦N_(limit)≦N_(size), and

[0020] iii) when N≦N_(limit), setting T_(ho)=min{T_(max), A*T′_(ho)}.

[0021] According to another preferred embodiment, the method comprises the steps of:

[0022] a) defining a plurality of table usage value N_(i) spanning an increasing range of N₁=0 to N₁=N_(size)

[0023] b) associating a corresponding plurality of time durations T₁ spanning a decreasing range of T₁=T_(max) to T₁=T_(min), and

[0024] c) comparing current table usage N to N₁ and setting T_(ho) to a corresponding value T_(i).

[0025] As an illustrative example, T_(min) may have a value in a range of 0.01 to 1.0 secs. and T_(max) may have a value in a range of 60 to 120 secs.

BRIEF DESCRIPTION OF THE DRAWINGS

[0026]FIG. 1 illustrates the definition of the size of a TCP connection control table.

[0027]FIG. 2 illustrates an exemplary range of half-open time-out, T_(ho)

[0028]FIG. 3 illustrates the overall system and method, according to an embodiment of the invention

[0029]FIG. 4 illustrates a preferred algorithm that is used for managing the half-open connection time-out, T_(ho).

[0030]FIG. 5 illustrates another algorithm that can be used for managing the half-open connection time-out, T_(ho).

DETAILED DESCRIPTION OF THE INVENTION

[0031]FIG. 1 illustrates the definition of the size of a TCP connection control table. The value N_(size) represents the size of the table and N represents the current use of the table. N is bounded by 0 (zero) and N_(size).

[0032]FIG. 2 illustrates the value range of the half-open time-out T_(ho). T_(ho) is bounded by the minimum time-out value T_(min) and the maximum time-out value T_(max). The T_(min) value is usually less than 1 second and the T_(max) value often used is either 60 seconds or 120 seconds depending on the installed TCP/IP stack.

[0033]FIG. 3 illustrates the overall system and method of this invention. The invented system 300 interact with any existing system 301 that monitors the half-open TCP connections and manages them using the half-open connection time-out T_(ho). Table Use Monitor (TUM) 302 monitors the use or usage of the TCP connection control table in a system 301. Half-open Connection Time-out Manager (HCTM) 303 computes the new value for T_(ho) using the table use information made available by Table Use Monitor (TUM) 302, and then it informs the new value T_(ho) to a system 301. Algorithms for computing T_(ho) are described later. The components 302 and 303 are required components. Connection Time Range Adjuster (CTRA) 304 is an optional component and it re-computes the time range [T_(min), T_(max)]. CTRA 304 makes the invented system and method adaptable to different operating environments. CTRA 304 continuously monitors the shortest duration T_(short) of any half-open TCP connection and the longest duration T_(long) of any half-open TCP connection that didn't time-out. After observing T_(short) and T_(long), T_(min) is set to T_(short) and T_(max) is set to T_(long), respectively. TCP Connection Request Throttler (TCRT) 305 is another optional component. The responsibility of this component is to discard or reset any newly arriving TCP connection requests had the table use level reached a predefined level of usage or use. TCRT 305 operations can be performed for every newly arriving TCP connection request by checking the current TCP connection table usage in a system 301.

[0034]FIG. 4 describes a preferred algorithm HCTM1 for computing the half-open time-out T_(ho). In this algorithm, two thresholds N_(limit) and N_(abs) are used. Here, N_(limit) is always less than N_(abs). N_(limit) indicates the number of “safely” usable entries in the TCP connection control table and its value is between 0 (zero) and the table size N_(size). A reasonable N_(limit) value is between 50% and 90% of N_(size). N_(abs) indicates the “absolute” bound and a reasonable value is between 90% and 99% of N_(size). Algorithm HCTM1 uses these two thresholds for computing T_(ho). Algorithm HCTM1 repeats the following computation periodically. This period is preferably on the order of a second. If N is greater than N_(abs), then T_(ho) is immediately set to the minimum value T_(min) to protect a system. If N is less than or equal to N_(abs) and if N is greater than N_(limit), then T_(ho) is reduced by setting it to max{T_(min), T_(ho)/A}. The max function is used to make sure that the value of T_(ho) will never be less than the minimum bound T_(min). Here, A is a parameter called “acceleration” and is either a constant (e.g., 2) or a variable. The value of A must be greater than 1 (one). If N is less than or equal N_(limit), then T_(ho) is increased to min{T_(max), A*T_(ho)}. The min function is used to make sure that the value of T_(ho) never exceeds the maximum value T_(max). The value for A may be computed from the following: 1ct n=n₁|n₂ where n₁ indicates the number of times N has exceeded N_(limit) in the last n observed cycles. Then, A can be set to as a function of 2*(n₁/n₂).

[0035]FIG. 5 illustrates yet another algorithm, Algorithm HCTM2, that can be used to compute the half-open time-out T_(ho) in the Half-open Connection Time-out Manager (HCTM) component 303 in FIG. 3. There are m thresholds called “trigger points”, N₁, N₂, . . . N_(i), . . . N_(m), and are in increasing order where N₁ is the smallest and N_(m) is the largest. For each trigger point N_(i), a half-open time-out T₁ is assigned, where T1=T_(max), and T_(m)=T_(min). Algorithm HCTM2 will repeat the following step periodically, just like Algorithm HCTM1 does. When the observed value N crosses over N₁ (i.e., N is between N₁ and N_(1+l)), the half-open time-out T_(ho) is set to T_(i).

[0036] While the present invention has been described with reference to preferred embodiments thereof, numerous obvious changes and variations may readily be made by persons skilled in the field of internet and other communications. Accordingly, the invention should be understood to include all such variations to the full extent embraced by the claims. 

What is claimed is
 1. A method of regulating TCP/IP connection requests which await service in a system by a TCP/IP connection control table to prevent overload thereof, said method comprising the steps of: a) monitoring usage of said system on a dynamic basis, b) based upon said usage, dynamically computing a time-out value T_(ho) which defines the time duration that a TCP connection request may await service by said system, and c) removing from said TCP/IP connection control table all TCP/IP connection requests which have been awaiting service in said TCP/IP stack for a duration exceeding T_(ho)
 2. A method as set forth in claim 1, wherein said TCP/IP connection control table has size N_(size) and an upper bound for usable table size of N_(abs)≦N_(size), and where values of T_(ho) are dynamically computed in a range [T_(min), T_(max)]
 3. A method as set forth in claim 2, comprising the steps of: i) setting T_(ho)=T_(min) when N>N_(abs), ii) when N>N_(limit) setting T_(ho)=max{T_(min), T′_(ho)/A}, where T′_(ho) is a previously existing value of T_(ho), where A>1, where N is the current usage of the table, and where 0≦N_(limit)≦N_(size), and iii) when N≦N_(limit), setting T_(ho)=min{T_(max), A*T′_(ho)}.
 4. A method as set forth in claim 2, comprising the steps of: a) defining a plurality of table usage value N_(i) spanning an increasing range of N₁=0 to N₁=N_(size), b) associating a corresponding plurality of time durations T₁ spanning a decreasing range of T_(i)=T_(max) to T_(i)=T_(min), and c) comparing current table usage N to N_(i) and setting T_(ho) to a corresponding value T₁.
 5. A method as set forth in claim 2, wherein T_(min) has a value in a range of 0.01 to To 1.0 secs. and wherein T_(max) has a value in a range of 60 to 120 secs. 